The function f of many variables defined on a convex set S is quasiconvex if every lower level set of f is convex. (That is, Pa = x ∈ S: f(x) ≤ a} is convex ...
An example is given by X=[1, 1] and f(x) = x. The form given in Table II is indeed an equivalence theorem in the spirit of Martos' result and follows directly ...
Let's consider a convex set Ω ⇢ IRn and the function f : Ω ! IR real function. Definition (Strictly quasi-concave) f is Strictly quasi-concave if for all x, ...
... 1: A real valued function is said to be quasi- convex if its domain of definition and all its sublevel sets: for , are convex, where denotes the set over ...
Quasiconvex programming is a generalization of convex programming. ... Quasiconvex programming is used in the solution of surrogate dual problems, whose biduals ...
Examples · f(x)=x2−2. It is a strictly quasiconvex function because if we take any two points x1,x2 in the domain that satisfy the constraints in the definition ...